Some Experiments on Indicators of Parsing Complexity for Lexicalized Grammars
نویسندگان
چکیده
In this paper, we identify syntactic lexical ambiguity and sentence complexity as factors that contribute to parsing complexity in fully lexicalized grammar formalisms such as Lexicalized Tree Adjoining Grammars. We also report on experiments that explore the effects of these factors on parsing complexity. We discuss how these constraints can be exploited in improving efficiency of parsers for such grammar formalisms.
منابع مشابه
Practical experiments in parsing using Tree Adjoining Grammars
We present an implementation of a chart-based head-corner parsing algorithm for lexicalized Tree Adjoining Grammars. We report on some practical experiments where we parse 2250 sentences from the Wall Street Journal using this parser. In these experiments the parser is run without any statistical pruning; it produces all valid parses for each sentence in the form of a shared derivation forest. ...
متن کاملA Uniform Method for Automatically Extracting Stochastic Lexicalized Tree Grammars from Treebanks and Hpsg
We present a uniform method for the extraction of stochastic lexicalized tree grammars (SLTG) of different complexities from existing treebanks as well as from competence-based grammars , which allows us to analyze the relationship of a grammar automatically induced from a treebank with respect to its size, its complexity, and its predictive power on unseen data. Processing of different SLTG is...
متن کاملAutomatic extraction of stochastic lexicalized tree grammars from treebanks
We present a uniform method for the extraction of stochastic lexicalized tree grammars (SLTG) of different complexities from existing treebanks as well as from competence-based grammars , which allows us to analyze the relationship of a grammar automatically induced from a treebank wrt. its size, its complexity, and its predictive power on unseen data. Processing of different SLTG is performed ...
متن کاملParsing Techniques for Lexicalized Context-free Grammars
State-of-the art parsers use lexicalized grammars to achieve high accuracy on real-world texts. Most of these systems are based on traditional parsing algorithms that were originally developed for the un-lexicalized versions of the adopted grammar formalisms. We show that these parsing algorithms do not perform eeciently when processing lexicalized grammars. We then develop novel parsing algori...
متن کاملAutomaton-based Parsing for Lexicalized Grammars
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that during parsing some of the computation associated with diierent structures is duplicated. This paper explores ways in which the grammar can be precompiled into nite state automata so that some of this shared structure results in shared computation at run-time.
متن کامل